Skip to content

Conversation

@wavegxd
Copy link

@wavegxd wavegxd commented Aug 1, 2017

No description provided.

Copy link
Contributor

@mmmaaatttttt mmmaaatttttt left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

A couple of tweaks needed here for part 1. Part 2 needs some love. Let me know if you have any questions!

@@ -0,0 +1,57 @@
/*
1. O(n)
2. O(log(n))
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

double check this - there's no log(n) in the original expression.

3. O(1)
4. O(n^3)
5. O(n)
6. O(log(n))
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

double check this one - which grows faster, log(n) or n?

10. O(n2)
*/

//1 O(n)
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

not sure whether these are time or space complexities. make sure you record both.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants